Algorithmic Resolution of LOTOS Equations
نویسنده
چکیده
The problem of extending a given LOTOS speciication P to a new given version R through the addition of a component X to be developed by scratch can be formulated in terms of an equation on LOTOS terms. The algorithmic solution of such an equation is a technical problem that has not been solved in a completely satisfactorily manner till now. In this paper we present an algorithm for the solution of a particular form of LOTOS equation, where strong bisimulation is used as terms equality. The kind of equation considered by the algorithm is shown to be able to express interesting cases of extensions of LOTOS speciications.
منابع مشابه
Compilation of LOTOS Abstract Data Types
Lotos data structures are described by sorts, which represent value domains, and operations, which are mathematical functions defined on these domains by algebraic equations. Value expressions are terms built from variables and operations. Sorts, operations, and equations are grouped in modules called types, which can be combined together using multiple inheritance, renaming, parametrization, a...
متن کاملResolution of Fuzzy Complex Systems of Linear Equations Via Wu's Method
The aim of this paper is to present algebraic method which is called Wu's method to solving fuzzy complex systems of linear equations. Wu's method is used as a solution procedure for solving the crisp polynomial equations system. This algorithm leads to solving characteristic sets that are amenable to easy solution. To illustrate the easy application of the proposed method, numerical examples a...
متن کاملRT-LOTOS and Its Application to Multimedia Protocol Specification and Validation
The paper presents a new Formal Description Technique , RT-LOTOS (Real-Time LOTOS), which is a temporal extension of the standard Formal Description Technique LOTOS. After a brief introduction to Basic LOTOS, the main time-related operators of RT-LOTOS are detailed step by step on small examples, and then formalized (RT-LOTOS operational semantics). The second part of the paper shows the applic...
متن کاملAn Enhanced Version of Timed LOTOS and its Application to a Case Study
We propose here ET-LOTOS, a timed extension of LOTOS. It is an enhancement of Timed LOTOS that we presented at FORTE 92. We show how some simple modifications allow us to improve the expressiveness of our former formalism. To assess ET-LOTOS, we apply it to the specification of a small case study. Finally, we show how the semantics of ET-LOTOS could be modified to easily define more powerful op...
متن کاملParallel Genetic Algorithm Using Algorithmic Skeleton
Algorithmic skeleton has received attention as an efficient method of parallel programming in recent years. Using the method, the programmer can implement parallel programs easily. In this study, a set of efficient algorithmic skeletons is introduced for use in implementing parallel genetic algorithm (PGA).A performance modelis derived for each skeleton that makes the comparison of skeletons po...
متن کامل